A fair distributed mutual exclusion algorithm
نویسندگان
چکیده
منابع مشابه
A Fair Distributed Mutual Exclusion Algorithm
ÐThis paper presents a fair decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. The algorithm requires between N ÿ 1 and 2 N ÿ 1 messages per critical section access, where N is the number of processes in the system. The exact message complexity can be expressed as a deterministic function of concurrency in the comput...
متن کاملA Distributed K-Mutual Exclusion Algorithm
This report presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is designed to minimize the number of messages and also the delay in entering the critical section, at low as well as high loads. The report presents simulation results for the proposed algorit...
متن کاملA Mutual Exclusion Algorithm Based on Request and Fair
iii PREFACE Process Synchronization is the set of techniques that are used to coordinate execution amongst processes. A common resource such as shared memory or a device may require exclusive access. In a multitasked/multithreaded system, processes have to coordinate amongst themselves to ensure that access is exclusive and fair. The mutual exclusion problem is one of the problems in inter-proc...
متن کاملA Token-Based Fair Algorithm for Group Mutual Exclusion in Distributed Systems
The group mutual exclusion (GME) problem is a generalization of the mutual exclusion problem. In group mutual exclusion, a process requests a session before entering its critical section (CS). Processes requesting the same session are allowed to be in their CS simultaneously, however, processes requesting different sessions must execute their CS in mutually exclusive way. The paper presents a t...
متن کاملA fair starvation-free prioritized mutual exclusion algorithm for distributed systems
Several distributed mutual exclusion algorithms define the order in which requests are satisfied based on the priorities assigned to requests. These algorithms are very useful for real-time applications ones or those where priority is associated to a quality of service requirement. However, priority based strategies may result in starvation problems where high priority requests forever prevent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2000
ISSN: 1045-9219
DOI: 10.1109/71.862205